Rapid almost-complete broadcasting in faulty networks
نویسندگان
چکیده
منابع مشابه
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixed number T , or a fraction α, of sent messages can be lost depending on which quantity is larger...
متن کاملOptimal broadcasting in networks with faulty nodes
Large computer networks are an essential part of modern technology, and quite often information needs to be broadcast to all the computers in the network. If all computers work perfectly all the time, this is simple. Suppose, however, that some of the computers fail occasionally. What is the fastest way to ensure that with high probability all working computers get the information? In this pape...
متن کاملOptimal Time Broadcasting in Faulty Star Networks
This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...
متن کاملBroadcasting on Faulty Hypercubes
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spa...
متن کاملBroadcasting with Many Faulty Links
We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.023